Well-Trained PETs: Improving Probability Estimation Trees
نویسندگان
چکیده
منابع مشابه
Improved Class Probability Estimates from Decision Tree Models
Decision tree models typically give good classification decisions but poor probability estimates. In many applications, it is important to have good probability estimates as well. This paper introduces a new algorithm, Bagged Lazy Option Trees (B-LOTs), for constructing decision trees and compares it to an alternative, Bagged Probability Estimation Trees (B-PETs). The quality of the class proba...
متن کاملA Comparison of Approaches for Learning First-Order Logical Probability Estimation Trees
Probability Estimation Trees (PETs) [9] try to estimate the probability with which an instance belongs to a certain class, rather than just predicting its most likely class. Several approaches for learning PETs have been proposed, mainly in a propositional context. Since we are interested in applying PETs in a relational context, we make some simple modifications to the first-order tree learner...
متن کاملImproving the AUC of Probabilistic Estimation Trees
In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that takes into account the class distributions of all the nodes from the root to each leaf. Secondly, we introduce or adapt some new splitting criteria aimed at improving probability estimates rather than improving classification ...
متن کاملMOB-ESP and other Improvements in Probability Estimation
A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probability estimation trees (Bagged-PETs) and also presents a new ensemble-based algorithm (MOB-ESP). Comparisons are made using several benchmark datasets and multiple metrics. These experiments show that MOB-ESP outputs si...
متن کاملDecision Trees for Ranking: Effect of new smoothing methods, new splitting criteria and simple pruning methods
In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that takes into account the class distributions of all the nodes from the root to each leaf. This enhances probability estimations with respect to other previous approaches without smoothing or with Laplace correction. Secondly, we...
متن کامل